Geometry Presorting for Implicit Object Space Partitioning
نویسندگان
چکیده
We present a new data structure for object space partitioning that can be represented completely implicitly. The bounds of each node in the tree structure are recreated at run-time from the scene objects contained therein. By applying a presorting procedure to the geometry, only a known fraction of the geometry is needed to locate the bounding planes of any node. We evaluate the impact of the implicit bounding plane representation and compare our algorithm to a classic bounding volume hierarchy. Though the representation is completely implicit, we still achieve interactive frame rates on commodity hardware. This is the author version of the paper. The definitive version is available at diglib.eg.org.
منابع مشابه
Implicit Object Space Partitioning: The No-Memory BVH
We present a new ray tracing algorithm that requires no explicit acceleration data structure and therefore no memory. It is represented in a completely implicit way by triangle reordering. This new implicit data structure is simple to build, efficient to traverse and has a fast total time to image. The implicit acceleration data structure must be constructed only once and can be reused for arbi...
متن کاملAnalysis of Broad-Phase Spatial Partitioning Optimisations in Collision Detection
This paper examines a number of broad-phase optimisations which can be used to improve the performance of collision detection in dynamic simulations. Specific focus is placed on hierarchical spatial partitioning techniques such as the octree, k-d tree and binary space partitioning (BSP) tree. A number of experiments are conducted using this subset of partitioning methods in order to evaluate th...
متن کاملEigenimage analysis for object recognition
A method for object recognition and pose estimation is presented. The approach discussed is a variant on current approaches to eigenimage analysis. Compared to traditional approaches which use object geometry only (shape invariants), the implementation described uses the eigenspace determined by processing the eigenvalues and eigenvectors of the image set. The image set is obtained by varying p...
متن کاملBinary Space Partitioning (BSP) Trees
A binary space partitioning (bsp) tree represents a recursive, hierarchical subdivision of d-dimensional space into convex subspaces. BSP trees provide a computational representation of space that provides both a search structure and a representation of geometry. Constructing a bsp tree consists of partitioning a subspace by means of a hyperplane, which intersects the interior of that subspace,...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 31 شماره
صفحات -
تاریخ انتشار 2012